Involution Solid Codes
نویسندگان
چکیده
منابع مشابه
Involution Solid and Join Codes
In this paper we study a generalization of the classical notions of solid codes and comma-free codes: involution solid codes (θ-solid) and involution join codes (θ-join). These notions are motivated by DNA strand design where Watson-Crick complementarity can be formalized as an antimorphic involution. We investigate closure properties of these codes, as well as necessary conditions for θ-solid ...
متن کاملInsertion and Deletion for Involution Codes
This paper introduces a generalization of the operation of catenation: u[k]lv, the left-k-insertion, is the set of all words obtained by inserting v into u in positions that are at most k letters away from the left extremity of the word u. We define k-suffix codes using the left-kinsertion operation and extend the concept of k-prefix and k-suffix codes to involution k-prefix and involution k-su...
متن کاملUltra and Involution Ideals in $BCK$-algebras
In this paper, we define the notions of ultra and involution ideals in $BCK$-algebras. Then we get the relation among them and other ideals as (positive) implicative, associative, commutative and prime ideals. Specially, we show that in a bounded implicative $BCK$-algebra, any involution ideal is a positive implicative ideal and in a bounded positive implicative lower $BCK$-semilattice, the not...
متن کاملInvolution Matrices of Real Quaternions
An involution or anti-involution is a self-inverse linear mapping. In this paper, we will present two real quaternion matrices, one corresponding to a real quaternion involution and one corresponding to a real quaternion anti-involution. Moreover, properties and geometrical meanings of these matrices will be given as reflections in R^3.
متن کاملAlgebraic space-time codes based on division algebras with a unitary involution
In this paper, we focus on the design of unitary space-time codes achieving full diversity using division algebras, and on the systematic computation of their minimum determinant. We also give examples of such codes with high minimum determinant. Division algebras allow to obtain higher rates than known constructions based on finite groups.
متن کامل